Geometric properties of spatial additively weighted Voronoi cells
نویسنده
چکیده
In this report, we discuss the geometric properties of spatial additively weighted Voronoi (AWV-) cells. First, we give a short survey of previously known properties of the geometry of these cells. Then, we give a detailed account on the geometry of the edges of AWV-cells. Finally, and this is our main contribution, we prove a new and tight lower bound of Θ(n2) on the worst-case combinatorial complexity of a single AWV-cell defined by n spheres.
منابع مشابه
Additively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries
The Optimal Sequenced Route (OSR) query strives to find a route of minimum length starting from a given source location and passing through a number of typed locations in a specific sequence imposed on the types of the locations. In this paper, we propose a precomputation approach to OSR query in vector spaces. We exploit the geometric properties of the solution space and theoretically prove it...
متن کاملSpanners of Additively Weighted Point Sets
We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs (p, r) where p is a point in the plane and r is a real number. The distance between two points (pi, ri) and (pj , rj) is defined as |pipj | − ri − rj . We show that in the case where all ri are positive numbers and |pipj | ≥ ri + rj for all i, j (in which case the po...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کامل3B.3 Mesh Sizing with Additively Weighted Voronoi Diagrams
We address the problem of generating mesh sizing functions from a set of points with specified sizing values. The sizing functions are shown to be maximal and K-Lipschitz, with arbitrary parameter K provided by the user. These properties allow generating low complexity meshes with adjustable gradation. After constructing an additively weighted Voronoi diagram, our algorithm provides fast and ac...
متن کاملVoroprot: an interactive tool for the analysis and visualization of complex geometric features of protein structure
UNLABELLED We present Voroprot, an interactive cross-platform software tool that provides a unique set of capabilities for exploring geometric features of protein structure. Voroprot allows the construction and visualization of the Apollonius diagram (also known as the additively weighted Voronoi diagram), the Apollonius graph, protein alpha shapes, interatomic contact surfaces, solvent accessi...
متن کامل